Quantum Random Oracle Model for Quantum Public-Key Encryption
نویسندگان
چکیده
منابع مشابه
Public Key Searchable Encryption without Random Oracle ⋆
This article is described a new Public Key Encryption with Keyword Search (PEKS) scheme, which is semantically secure against chosen keyword attack, without assuming random oracle. The security of our scheme depends on the complexity assumption of Strong Diffie-Hellman (SDH). The computation operation for constructing cipher text and trapdoor of keyword is simpler than the most schemes introduc...
متن کاملSecure Identity-Based Encryption in the Quantum Random Oracle Model
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model that requires no additional assumptions. Our techniques are quite general and we use them to obtain security proofs for two random oracle hierarchical identity-based encryption schemes and a random oracle signature schem...
متن کاملAdaptively Anonymous Public-Key Broadcast Encryption Scheme without Random Oracle
Anonymous is one of the most important security properties for kinds of Internet applications. In this paper, we consider the privacy-preserving problem in the context of public key broadcast encryption. We provide a new security definition for anonymous public key broadcast encryption, and construct a new scheme. To achieve anonymous, we blind the ciphertexts using the random factors. Moreover...
متن کاملPublic Key Encryption Algorithm and the Random Oracle
Cryptographic theory has provided a potentially invaluable notion for cryptographic practice: the idea of provable security. Unfortunately, theoretical work often gains provable security only at the cost of effciency. Schemes like standard RSA are efficient but not provably secured. There are schemes who are provably secured but are not efficient. However, there are encryption schemes, for eg. ...
متن کاملBit-oriented quantum public-key encryption
We propose a bit-oriented quantum public-key scheme which uses Boolean function as private-key and randomly changed pairs of quantum state and classical string as public-keys. Contrast to the typical classical public-key scheme, one private-key in our scheme corresponds to an exponential number of public-keys. The goal of our scheme is to achieve information-theoretic security, and the security...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2940406